An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing
نویسندگان
چکیده
منابع مشابه
Hybrid parallel computing of minimum action method
In this work, we report a hybrid (MPI/OpenMP) parallelization strategy for the minimum action method recently proposed in [17]. For nonlinear dynamical systems, the minimum action method is a useful numerical tool to study the transition behavior induced by small noise and the structure of the phase space. The crucial part of the minimum action method is to minimize the Freidlin–Wentzell action...
متن کاملGPU-Based Parallel Nonlinear Conjugate Gradient Algorithms
In this paper we describe some parallel algorithms for solving nonlinear systems using CUDA (Compute Unified Device Architecture) over a GPU (Graphics Processing Unit). The proposed algorithms are based on both the Fletcher-Reeves version of the nonlinear conjugate gradient method and a polynomial preconditioner type based on block two-stage methods. Several strategies of parallelization and di...
متن کاملA Parallel Preconditioned Bi-Conjugate Gradient Stabilized Solver for the Poisson Problem
We present a parallel Preconditioned BiConjugate Gradient Stabilized(BICGstab) solver for the Poisson problem. Given a real, nosymmetric and positive definite coefficient matrix , the parallized Preconditioned BICGstab -solver is able to find a solution for that system by exploiting the massive compute power of todays GPUs.Comparing sequential CPU implementations and that algorithm.we achieve a...
متن کاملAnalysis of Parallel Preconditioned Conjugate Gradient Algorithms
The conjugate gradient method is an iterative technique used to solve systems of linear equations. The paper analyzes the performance of parallel preconditioned conjugate gradient algorithms. First, a theoretical model is proposed for estimation of the complexity of PPCG method and a scalability analysis is done for three different data decomposition cases. Computational experiments are done on...
متن کاملA Parallel Preconditioned Bi-Conjugate Gradient Stabilized Solver for the Poisson Problem
We present a parallel Preconditioned BiConjugate Gradient Stabilized(BICGstab) solver for the Poisson problem. Given a real, nosymmetric and positive definite coefficient matrix , the parallized Preconditioned BICGstab -solver is able to find a solution for that system by exploiting the massive compute power of todays GPUs.Comparing sequential CPU implementations and that algorithm.we achieve a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.05.017